A Minkowski area having no convex extension.
نویسندگان
چکیده
منابع مشابه
Minkowski addition of convex polytopes
This note summarizes recent results from computational geometry which determine complexity of computing Minkowski sum of k convex polytopes in R, which are represented either in terms of facets or in terms of vertices. In particular, it is pointed out for which cases there exists an algorithm which runs in polynomial time. The note is based on papers of Gritzmann and Sturmfels [6] and Komei Fuk...
متن کاملMinkowski valuations on convex functions
A classification of [Formula: see text] contravariant Minkowski valuations on convex functions and a characterization of the projection body operator are established. The associated LYZ measure is characterized. In addition, a new [Formula: see text] covariant Minkowski valuation on convex functions is defined and characterized.
متن کاملMinkowski Problems for Complete Noncompact Convex Hypersurfaces
LetX be a compact, strictly convex C-hypersurface in the (n+1)-dimensional Euclidean space R. The Gauss map ofX maps the hypersurface one-to-one and onto the unit n-sphere S. One may parametrize X by the inverse of the Gauss map. Consequently, the Gauss curvature can be regarded as a function on S. The classical Minkowski problem asks conversely when a positive function K on S is the Gauss curv...
متن کاملBlaschke- and Minkowski-endomorphisms of Convex Bodies
We consider maps of the family of convex bodies in Euclidean ddimensional space into itself that are compatible with certain structures on this family: A Minkowski-endomorphism is a continuous, Minkowski-additive map that commutes with rotations. For d ≥ 3, a representation theorem for such maps is given, showing that they are mixtures of certain prototypes. These prototypes are obtained by app...
متن کاملMinkowski decomposition of convex lattice polygons
A relatively recent area of study in geometric modelling concerns toric Bézier patches. In this line of work, several questions reduce to testing whether a given convex lattice polygon can be decomposed into a Minkowski sum of two such polygons and, if so, to finding one or all such decompositions. Other motivations for this problem include sparse resultant computation, especially for the impli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1971
ISSN: 0026-2285
DOI: 10.1307/mmj/1029000683